Signaling for modified deblocking filter operations

ABSTRACT

A method for video decoding includes decoding prediction information for a current block in a current picture that is a part of a coded video sequence, the prediction information including a first syntax element and a second syntax element. The first syntax element indicates that a deblocking filter process is enabled for the current block, the deblocking filter process being applied to a boundary of the current block. The second syntax element indicates a number of samples to be used for calculating a boundary strength of the deblocking filter process. The method also includes determining the boundary strength of the deblocking filter process using the number of samples indicated by the second syntax element, and performing the deblocking filter process for the current block based on the boundary strength.

INCORPORATION BY REFERENCE

The present application is a continuation of U.S. application Ser. No.17/077,706 filed on Oct. 22, 2020, which claims the benefit of priorityto U.S. Provisional Application No. 63/001,149, “HIGH LEVEL CONTROL FORDEBLOCKING OPERATIONS” filed on Mar. 27, 2020. The disclosures of theprior applications are hereby incorporated by reference in theirentirety.

TECHNICAL FIELD

The present disclosure describes embodiments generally related to videocoding.

BACKGROUND

The background description provided herein is for the purpose ofgenerally presenting the context of the disclosure. Work of thepresently named inventors, to the extent the work is described in thisbackground section, as well as aspects of the description that may nototherwise qualify as prior art at the time of filing, are neitherexpressly nor impliedly admitted as prior art against the presentdisclosure.

Video coding and decoding can be performed using inter-pictureprediction with motion compensation. Uncompressed digital video caninclude a series of pictures, each picture having a spatial dimensionof, for example, 1920×1080 luminance samples and associated chrominancesamples. The series of pictures can have a fixed or variable picturerate (informally also known as frame rate) of, for example, 60 picturesper second or 60 Hz. Uncompressed video has significant bitraterequirements. For example, 1080p60 4:2:0 video at 8 bit per sample(1920×1080 luminance sample resolution at 60 Hz frame rate) requiresclose to 1.5 Gbit/s bandwidth. An hour of such video requires more than600 GBytes of storage space.

One purpose of video coding and decoding can be the reduction ofredundancy in the input video signal, through compression. Compressioncan help reduce the aforementioned bandwidth or storage spacerequirements, in some cases by two orders of magnitude or more. Bothlossless and lossy compression, as well as a combination thereof can beemployed. Lossless compression refers to techniques where an exact copyof the original signal can be reconstructed from the compressed originalsignal. When using lossy compression, the reconstructed signal may notbe identical to the original signal, but the distortion between originaland reconstructed signals is small enough to make the reconstructedsignal useful for the intended application. In the case of video, lossycompression is widely employed. The amount of distortion tolerateddepends on the application; for example, users of certain consumerstreaming applications may tolerate higher distortion than users oftelevision distribution applications. The compression ratio achievablecan reflect that: higher allowable/tolerable distortion can yield highercompression ratios.

A video encoder and decoder can utilize techniques from several broadcategories, including, for example, motion compensation, transform,quantization, and entropy coding.

Video codec technologies can include techniques known as intra coding.In intra coding, sample values are represented without reference tosamples or other data from previously reconstructed reference pictures.In some video codecs, the picture is spatially subdivided into blocks ofsamples. When all blocks of samples are coded in intra mode, thatpicture can be an intra picture. Intra pictures and their derivationssuch as independent decoder refresh pictures, can be used to reset thedecoder state and can, therefore, be used as the first picture in acoded video bitstream and a video session, or as a still image. Thesamples of an intra block can be exposed to a transform, and thetransform coefficients can be quantized before entropy coding. Intraprediction can be a technique that minimizes sample values in thepre-transform domain. In some cases, the smaller the DC value after atransform is, and the smaller the AC coefficients are, the fewer thebits that are required at a given quantization step size to representthe block after entropy coding.

Traditional intra coding such as known from, for example MPEG-2generation coding technologies, does not use intra prediction. However,some newer video compression technologies include techniques thatattempt, from, for example, surrounding sample data and/or metadataobtained during the encoding/decoding of spatially neighboring, andpreceding in decoding order, blocks of data. Such techniques arehenceforth called “intra prediction” techniques. Note that in at leastsome cases, intra prediction is only using reference data from thecurrent picture under reconstruction and not from reference pictures.

There can be many different forms of intra prediction. When more thanone of such techniques can be used in a given video coding technology,the technique in use can be coded in an intra prediction mode. Incertain cases, modes can have submodes and/or parameters, and those canbe coded individually or included in the mode codeword. Which codewordto use for a given mode/submode/parameter combination can have an impactin the coding efficiency gain through intra prediction, and so can theentropy coding technology used to translate the codewords into abitstream.

A certain mode of intra prediction was introduced with H.264, refined inH.265, and further refined in newer coding technologies such as jointexploration model (JEM), versatile video coding (VVC), and benchmark set(BMS). A predictor block can be formed using neighboring sample valuesbelonging to already available samples. Sample values of neighboringsamples are copied into the predictor block according to a direction. Areference to the direction in use can be coded in the bitstream or maybe predicted itself.

Referring to FIG. 1A, depicted in the lower right is a subset of ninepredictor directions known from H.265's 33 possible predictor directions(corresponding to the 33 angular modes of the 35 intra modes). The pointwhere the arrows converge (101) represents the sample being predicted.The arrows represent the direction from which the sample is beingpredicted. For example, arrow (102) indicates that sample (101) ispredicted from a sample or samples to the upper right, at a 45 degreeangle from the horizontal. Similarly, arrow (103) indicates that sample(101) is predicted from a sample or samples to the lower left of sample(101), in a 22.5 degree angle from the horizontal.

Still referring to FIG. 1A, on the top left there is depicted a squareblock (104) of 4×4 samples (indicated by a dashed, boldface line). Thesquare block (104) includes 16 samples, each labelled with an “S”, itsposition in the Y dimension (e.g., row index) and its position in the Xdimension (e.g., column index). For example, sample S21 is the secondsample in the Y dimension (from the top) and the first (from the left)sample in the X dimension. Similarly, sample S44 is the fourth sample inblock (104) in both the Y and X dimensions. As the block is 4×4 samplesin size, S44 is at the bottom right. Further shown are reference samplesthat follow a similar numbering scheme. A reference sample is labelledwith an R, its Y position (e.g., row index) and X position (columnindex) relative to block (104). In both H.264 and H.265, predictionsamples neighbor the block under reconstruction; therefore no negativevalues need to be used.

Intra picture prediction can work by copying reference sample valuesfrom the neighboring samples as appropriated by the signaled predictiondirection. For example, assume the coded video bitstream includessignaling that, for this block, indicates a prediction directionconsistent with arrow (102)—that is, samples are predicted from aprediction sample or samples to the upper right, at a 45 degree anglefrom the horizontal. In that case, samples S41, S32, S23, and S14 arepredicted from the same reference sample R05. Sample S44 is thenpredicted from reference sample R08.

In certain cases, the values of multiple reference samples may becombined, for example through interpolation, in order to calculate areference sample; especially when the directions are not evenlydivisible by 45 degrees.

The number of possible directions has increased as video codingtechnology has developed. In H.264 (year 2003), nine different directioncould be represented. That increased to 33 in H.265 (year 2013), andJEM/VVC/BMS, at the time of disclosure, can support up to 65 directions.Experiments have been conducted to identify the most likely directions,and certain techniques in the entropy coding are used to represent thoselikely directions in a small number of bits, accepting a certain penaltyfor less likely directions. Further, the directions themselves cansometimes be predicted from neighboring directions used in neighboring,already decoded, blocks.

FIG. 1B shows a schematic (105) that depicts 65 intra predictiondirections according to JEM to illustrate the increasing number ofprediction directions over time.

The mapping of intra prediction directions bits in the coded videobitstream that represent the direction can be different from videocoding technology to video coding technology; and can range, forexample, from simple direct mappings of prediction direction to intraprediction mode, to codewords, to complex adaptive schemes involvingmost probable modes, and similar techniques. In all cases, however,there can be certain directions that are statistically less likely tooccur in video content than certain other directions. As the goal ofvideo compression is the reduction of redundancy, those less likelydirections will, in a well working video coding technology, berepresented by a larger number of bits than more likely directions.

Motion compensation can be a lossy compression technique and can relateto techniques where a block of sample data from a previouslyreconstructed picture or part thereof (reference picture), after beingspatially shifted in a direction indicated by a motion vector (MVhenceforth), is used for the prediction of a newly reconstructed pictureor picture part. In some cases, the reference picture can be the same asthe picture currently under reconstruction. MVs can have two dimensionsX and Y, or three dimensions, the third being an indication of thereference picture in use (the latter, indirectly, can be a timedimension).

In some video compression techniques, an MV applicable to a certain areaof sample data can be predicted from other MVs, for example from thoserelated to another area of sample data spatially adjacent to the areaunder reconstruction, and preceding that MV in decoding order. Doing socan substantially reduce the amount of data required for coding the MV,thereby removing redundancy and increasing compression. MV predictioncan work effectively, for example, because when coding an input videosignal derived from a camera (known as natural video) there is astatistical likelihood that areas larger than the area to which a singleMV is applicable move in a similar direction and, therefore, can in somecases be predicted using a similar motion vector derived from MVs of aneighboring area. That results in the MV found for a given area to besimilar or the same as the MV predicted from the surrounding MVs, andthat in turn can be represented, after entropy coding, in a smallernumber of bits than what would be used if coding the MV directly. Insome cases, MV prediction can be an example of lossless compression of asignal (namely: the MVs) derived from the original signal (namely: thesample stream). In other cases, MV prediction itself can be lossy, forexample because of rounding errors when calculating a predictor fromseveral surrounding MVs.

Various MV prediction mechanisms are described in H.265/HEVC (ITU-T Rec.H.265, “High Efficiency Video Coding”, December 2016). Out of the manyMV prediction mechanisms that H.265 offers, described herein is atechnique henceforth referred to as “spatial merge.”

Referring to FIG. 1C, a current block (111) can include samples thathave been found by the encoder during the motion search process to bepredictable from a previous block of the same size that has beenspatially shifted. Instead of coding that MV directly, the MV can bederived from metadata associated with one or more reference pictures,for example from the most recent (in decoding order) reference picture,using the MV associated with either one of five surrounding samples,denoted A0, A1, and B0, B1, B2 (112 through 116, respectively). InH.265, the MV prediction can use predictors from the same referencepicture that the neighboring block is using.

SUMMARY

Aspects of the disclosure provide apparatuses for videoencoding/decoding. One apparatus includes processing circuitry thatdecodes prediction information for a current block in a current picturethat is a part of a coded video sequence. The prediction informationincludes a first syntax element and a second syntax element. Theprocessing circuitry determines whether a plurality of processes ofdetermining a boundary strength (BS) of a deblocking filter is allowedfor the current block based on the first syntax element. The deblockingfilter is applied to a boundary of the current block. When the pluralityof processes of determining the BS of the deblocking filter is allowedfor the current block, the processing circuitry determines a subset ofthe plurality of processes of determining the BS of the deblockingfilter for the current block based on the second syntax element. Theprocessing circuitry determines the BS of the deblocking filter for thecurrent block based on the subset of the plurality of processes ofdetermining the BS of the deblocking filter.

In an embodiment, the BS of the deblocking filter for the current blockis determined based on a plurality of samples located in one of tworegions separated by the boundary of the current block. In an example, anumber of the plurality of samples located in the one of two regionsseparated by the boundary of the current block is one of two and four.

In an embodiment, the processing circuitry determines whether a samplevalue difference between two samples separated by the boundary of thecurrent block is greater than a threshold. When the sample valuedifference between the two samples separated by the boundary of thecurrent block is greater than the threshold, the processing circuitrydetermines that no deblocking filter is applied to the boundary of thecurrent block.

In an embodiment, the first syntax element is at a sequence parameterset level.

In an embodiment, the processing circuitry determines the one of theplurality of processes of determining the BS of the deblocking filterfor the current block based on the second syntax element and adeblocking control flag indicating that a filtering operation is enabledfor the current block. In an example, the second syntax element is atone of a picture level, a slice level, and a same level as thedeblocking control flag.

Aspects of the disclosure provide methods for video encoding/decoding.In the method, prediction information is decoded for a current block ina current picture that is a part of a coded video sequence. Theprediction information includes a first syntax element and a secondsyntax element. Whether a plurality of processes of determining a BS ofa deblocking filter is allowed for the current block is determined basedon the first syntax element. The deblocking filter is applied to aboundary of the current block. When the plurality of processes ofdetermining the BS of the deblocking filter is allowed for the currentblock, a subset of the plurality of processes of determining the BS ofthe deblocking filter for the current block is determined based on thesecond syntax element. The BS of the deblocking filter for the currentblock is determined based on the subset of the plurality of processes ofdetermining the BS of the deblocking filter.

Aspects of the disclosure also provide non-transitory computer-readablemediums storing instructions which when executed by a computer for videodecoding cause the computer to perform any one or a combination of themethods for video decoding.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features, the nature, and various advantages of the disclosedsubject matter will be more apparent from the following detaileddescription and the accompanying drawings in which:

FIG. 1A is a schematic illustration of an exemplary subset of intraprediction modes;

FIG. 1B is an illustration of exemplary intra prediction directions;

FIG. 1C is a schematic illustration of a current block and itssurrounding spatial merge candidates in one example;

FIG. 2 is a schematic illustration of a simplified block diagram of acommunication system in accordance with an embodiment;

FIG. 3 is a schematic illustration of a simplified block diagram of acommunication system in accordance with an embodiment;

FIG. 4 is a schematic illustration of a simplified block diagram of adecoder in accordance with an embodiment;

FIG. 5 is a schematic illustration of a simplified block diagram of anencoder in accordance with an embodiment;

FIG. 6 shows a block diagram of an encoder in accordance with anotherembodiment;

FIG. 7 shows a block diagram of a decoder in accordance with anotherembodiment;

FIG. 8 shows a flow chart of an exemplary process for determining aboundary strength value in accordance with an embodiment;

FIG. 9 shows exemplary sample positions for determining the boundarystrength value in accordance with an embodiment;

FIG. 10 shows exemplary sample positions for determining the boundarystrength value in accordance with another embodiment;

FIG. 11 shows a flow chart outlining an exemplary process according toan embodiment of the disclosure; and

FIG. 12 is a schematic illustration of a computer system in accordancewith an embodiment.

DETAILED DESCRIPTION OF EMBODIMENTS

I. Video Decoder and Encoder Systems

FIG. 2 illustrates a simplified block diagram of a communication system(200) according to an embodiment of the present disclosure. Thecommunication system (200) includes a plurality of terminal devices thatcan communicate with each other, via, for example, a network (250). Forexample, the communication system (200) includes a first pair ofterminal devices (210) and (220) interconnected via the network (250).In the FIG. 2 example, the first pair of terminal devices (210) and(220) performs unidirectional transmission of data. For example, theterminal device (210) may code video data (e.g., a stream of videopictures that are captured by the terminal device (210)) fortransmission to the other terminal device (220) via the network (250).The encoded video data can be transmitted in the form of one or morecoded video bitstreams. The terminal device (220) may receive the codedvideo data from the network (250), decode the coded video data torecover the video pictures and display video pictures according to therecovered video data. Unidirectional data transmission may be common inmedia serving applications and the like.

In another example, the communication system (200) includes a secondpair of terminal devices (230) and (240) that performs bidirectionaltransmission of coded video data that may occur, for example, duringvideoconferencing. For bidirectional transmission of data, in anexample, each terminal device of the terminal devices (230) and (240)may code video data (e.g., a stream of video pictures that are capturedby the terminal device) for transmission to the other terminal device ofthe terminal devices (230) and (240) via the network (250). Eachterminal device of the terminal devices (230) and (240) also may receivethe coded video data transmitted by the other terminal device of theterminal devices (230) and (240), and may decode the coded video data torecover the video pictures and may display video pictures at anaccessible display device according to the recovered video data.

In the FIG. 2 example, the terminal devices (210), (220), (230) and(240) may be illustrated as servers, personal computers and smart phonesbut the principles of the present disclosure may be not so limited.Embodiments of the present disclosure find application with laptopcomputers, tablet computers, media players and/or dedicated videoconferencing equipment. The network (250) represents any number ofnetworks that convey coded video data among the terminal devices (210),(220), (230) and (240), including for example wireline (wired) and/orwireless communication networks. The communication network (250) mayexchange data in circuit-switched and/or packet-switched channels.Representative networks include telecommunications networks, local areanetworks, wide area networks and/or the Internet. For the purposes ofthe present discussion, the architecture and topology of the network(250) may be immaterial to the operation of the present disclosureunless explained herein below.

FIG. 3 illustrates, as an example for an application for the disclosedsubject matter, the placement of a video encoder and a video decoder ina streaming environment. The disclosed subject matter can be equallyapplicable to other video enabled applications, including, for example,video conferencing, digital TV, storing of compressed video on digitalmedia including CD, DVD, memory stick, and the like.

A streaming system may include a capture subsystem (313) that caninclude a video source (301), for example a digital camera, creating forexample a stream of video pictures (302) that are uncompressed. In anexample, the stream of video pictures (302) includes samples that aretaken by the digital camera. The stream of video pictures (302),depicted as a bold line to emphasize a high data volume when compared toencoded video data (304) (or coded video bitstreams), can be processedby an electronic device (320) that includes a video encoder (303)coupled to the video source (301). The video encoder (303) can includehardware, software, or a combination thereof to enable or implementaspects of the disclosed subject matter as described in more detailbelow. The encoded video data (304) (or encoded video bitstream (304)),depicted as a thin line to emphasize the lower data volume when comparedto the stream of video pictures (302), can be stored on a streamingserver (305) for future use. One or more streaming client subsystems,such as client subsystems (306) and (308) in FIG. 3 can access thestreaming server (305) to retrieve copies (307) and (309) of the encodedvideo data (304). A client subsystem (306) can include a video decoder(310), for example, in an electronic device (330). The video decoder(310) decodes the incoming copy (307) of the encoded video data andcreates an outgoing stream of video pictures (311) that can be renderedon a display (312) (e.g., display screen) or other rendering device (notdepicted). In some streaming systems, the encoded video data (304),(307), and (309) (e.g., video bitstreams) can be encoded according tocertain video coding/compression standards. Examples of those standardsinclude ITU-T Recommendation H.265. In an example, a video codingstandard under development is informally known as Versatile Video Coding(VVC). The disclosed subject matter may be used in the context of VVC.

It is noted that the electronic devices (320) and (330) can includeother components (not shown). For example, the electronic device (320)can include a video decoder (not shown) and the electronic device (330)can include a video encoder (not shown) as well.

FIG. 4 shows a block diagram of a video decoder (410) according to anembodiment of the present disclosure. The video decoder (410) can beincluded in an electronic device (430). The electronic device (430) caninclude a receiver (431) (e.g., receiving circuitry). The video decoder(410) can be used in the place of the video decoder (310) in the FIG. 3example.

The receiver (431) may receive one or more coded video sequences to bedecoded by the video decoder (410); in the same or another embodiment,one coded video sequence at a time, where the decoding of each codedvideo sequence is independent from other coded video sequences. Thecoded video sequence may be received from a channel (401), which may bea hardware/software link to a storage device which stores the encodedvideo data. The receiver (431) may receive the encoded video data withother data, for example, coded audio data and/or ancillary data streams,that may be forwarded to their respective using entities (not depicted).The receiver (431) may separate the coded video sequence from the otherdata. To combat network jitter, a buffer memory (415) may be coupled inbetween the receiver (431) and an entropy decoder/parser (420) (“parser(420)” henceforth). In certain applications, the buffer memory (415) ispart of the video decoder (410). In others, it can be outside of thevideo decoder (410) (not depicted). In still others, there can be abuffer memory (not depicted) outside of the video decoder (410), forexample to combat network jitter, and in addition another buffer memory(415) inside the video decoder (410), for example to handle playouttiming. When the receiver (431) is receiving data from a store/forwarddevice of sufficient bandwidth and controllability, or from anisosynchronous network, the buffer memory (415) may not be needed, orcan be small. For use on best effort packet networks such as theInternet, the buffer memory (415) may be required, can be comparativelylarge and can be advantageously of adaptive size, and may at leastpartially be implemented in an operating system or similar elements (notdepicted) outside of the video decoder (410).

The video decoder (410) may include the parser (420) to reconstructsymbols (421) from the coded video sequence. Categories of those symbolsinclude information used to manage operation of the video decoder (410),and potentially information to control a rendering device such as arender device (412) (e.g., a display screen) that is not an integralpart of the electronic device (430) but can be coupled to the electronicdevice (430), as was shown in FIG. 4 . The control information for therendering device(s) may be in the form of Supplemental EnhancementInformation (SEI messages) or Video Usability Information (VUI)parameter set fragments (not depicted). The parser (420) mayparse/entropy-decode the coded video sequence that is received. Thecoding of the coded video sequence can be in accordance with a videocoding technology or standard, and can follow various principles,including variable length coding, Huffman coding, arithmetic coding withor without context sensitivity, and so forth. The parser (420) mayextract from the coded video sequence, a set of subgroup parameters forat least one of the subgroups of pixels in the video decoder, based uponat least one parameter corresponding to the group. Subgroups can includeGroups of Pictures (GOPs), pictures, tiles, slices, macroblocks, CodingUnits (CUs), blocks, Transform Units (TUs), Prediction Units (PUs) andso forth. The parser (420) may also extract from the coded videosequence information such as transform coefficients, quantizer parametervalues, motion vectors, and so forth.

The parser (420) may perform an entropy decoding/parsing operation onthe video sequence received from the buffer memory (415), so as tocreate symbols (421).

Reconstruction of the symbols (421) can involve multiple different unitsdepending on the type of the coded video picture or parts thereof (suchas: inter and intra picture, inter and intra block), and other factors.Which units are involved, and how, can be controlled by the subgroupcontrol information that was parsed from the coded video sequence by theparser (420). The flow of such subgroup control information between theparser (420) and the multiple units below is not depicted for clarity.

Beyond the functional blocks already mentioned, the video decoder (410)can be conceptually subdivided into a number of functional units asdescribed below. In a practical implementation operating undercommercial constraints, many of these units interact closely with eachother and can, at least partly, be integrated into each other. However,for the purpose of describing the disclosed subject matter, theconceptual subdivision into the functional units below is appropriate.

A first unit is the scaler/inverse transform unit (451). Thescaler/inverse transform unit (451) receives a quantized transformcoefficient as well as control information, including which transform touse, block size, quantization factor, quantization scaling matrices,etc. as symbol(s) (421) from the parser (420). The scaler/inversetransform unit (451) can output blocks comprising sample values that canbe input into aggregator (455).

In some cases, the output samples of the scaler/inverse transform (451)can pertain to an intra coded block; that is: a block that is not usingpredictive information from previously reconstructed pictures, but canuse predictive information from previously reconstructed parts of thecurrent picture. Such predictive information can be provided by an intrapicture prediction unit (452). In some cases, the intra pictureprediction unit (452) generates a block of the same size and shape ofthe block under reconstruction, using surrounding already reconstructedinformation fetched from the current picture buffer (458). The currentpicture buffer (458) buffers, for example, partly reconstructed currentpicture and/or fully reconstructed current picture. The aggregator(455), in some cases, adds, on a per sample basis, the predictioninformation that the intra prediction unit (452) has generated to theoutput sample information as provided by the scaler/inverse transformunit (451).

In other cases, the output samples of the scaler/inverse transform unit(451) can pertain to an inter coded, and potentially motion compensatedblock. In such a case, a motion compensation prediction unit (453) canaccess reference picture memory (457) to fetch samples used forprediction. After motion compensating the fetched samples in accordancewith the symbols (421) pertaining to the block, these samples can beadded by the aggregator (455) to the output of the scaler/inversetransform unit (451) (in this case called the residual samples orresidual signal) so as to generate output sample information. Theaddresses within the reference picture memory (457) from where themotion compensation prediction unit (453) fetches prediction samples canbe controlled by motion vectors, available to the motion compensationprediction unit (453) in the form of symbols (421) that can have, forexample X, Y, and reference picture components. Motion compensation alsocan include interpolation of sample values as fetched from the referencepicture memory (457) when sub-sample exact motion vectors are in use,motion vector prediction mechanisms, and so forth.

The output samples of the aggregator (455) can be subject to variousloop filtering techniques in the loop filter unit (456). Videocompression technologies can include in-loop filter technologies thatare controlled by parameters included in the coded video sequence (alsoreferred to as coded video bitstream) and made available to the loopfilter unit (456) as symbols (421) from the parser (420), but can alsobe responsive to meta-information obtained during the decoding ofprevious (in decoding order) parts of the coded picture or coded videosequence, as well as responsive to previously reconstructed andloop-filtered sample values.

The output of the loop filter unit (456) can be a sample stream that canbe output to the render device (412) as well as stored in the referencepicture memory (457) for use in future inter-picture prediction.

Certain coded pictures, once fully reconstructed, can be used asreference pictures for future prediction. For example, once a codedpicture corresponding to a current picture is fully reconstructed andthe coded picture has been identified as a reference picture (by, forexample, the parser (420)), the current picture buffer (458) can becomea part of the reference picture memory (457), and a fresh currentpicture buffer can be reallocated before commencing the reconstructionof the following coded picture.

The video decoder (410) may perform decoding operations according to apredetermined video compression technology in a standard, such as ITU-TRec. H.265. The coded video sequence may conform to a syntax specifiedby the video compression technology or standard being used, in the sensethat the coded video sequence adheres to both the syntax of the videocompression technology or standard and the profiles as documented in thevideo compression technology or standard. Specifically, a profile canselect certain tools as the only tools available for use under thatprofile from all the tools available in the video compression technologyor standard. Also necessary for compliance can be that the complexity ofthe coded video sequence is within bounds as defined by the level of thevideo compression technology or standard. In some cases, levels restrictthe maximum picture size, maximum frame rate, maximum reconstructionsample rate (measured in, for example megasamples per second), maximumreference picture size, and so on. Limits set by levels can, in somecases, be further restricted through Hypothetical Reference Decoder(HRD) specifications and metadata for HRD buffer management signaled inthe coded video sequence.

In an embodiment, the receiver (431) may receive additional (redundant)data with the encoded video. The additional data may be included as partof the coded video sequence(s). The additional data may be used by thevideo decoder (410) to properly decode the data and/or to moreaccurately reconstruct the original video data. Additional data can bein the form of, for example, temporal, spatial, or signal noise ratio(SNR) enhancement layers, redundant slices, redundant pictures, forwarderror correction codes, and so on.

FIG. 5 shows a block diagram of a video encoder (503) according to anembodiment of the present disclosure. The video encoder (503) isincluded in an electronic device (520). The electronic device (520)includes a transmitter (540) (e.g., transmitting circuitry). The videoencoder (503) can be used in the place of the video encoder (303) in theFIG. 3 example.

The video encoder (503) may receive video samples from a video source(501) (that is not part of the electronic device (520) in the FIG. 5example) that may capture video image(s) to be coded by the videoencoder (503). In another example, the video source (501) is a part ofthe electronic device (520).

The video source (501) may provide the source video sequence to be codedby the video encoder (503) in the form of a digital video sample streamthat can be of any suitable bit depth (for example: 8 bit, 10 bit, 12bit, . . . ), any colorspace (for example, BT.601 Y CrCB, RGB, . . . ),and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCb4:4:4). In a media serving system, the video source (501) may be astorage device storing previously prepared video. In a videoconferencingsystem, the video source (501) may be a camera that captures local imageinformation as a video sequence. Video data may be provided as aplurality of individual pictures that impart motion when viewed insequence. The pictures themselves may be organized as a spatial array ofpixels, wherein each pixel can comprise one or more samples depending onthe sampling structure, color space, etc. in use. A person skilled inthe art can readily understand the relationship between pixels andsamples. The description below focuses on samples.

According to an embodiment, the video encoder (503) may code andcompress the pictures of the source video sequence into a coded videosequence (543) in real time or under any other time constraints asrequired by the application. Enforcing appropriate coding speed is onefunction of a controller (550). In some embodiments, the controller(550) controls other functional units as described below and isfunctionally coupled to the other functional units. The coupling is notdepicted for clarity. Parameters set by the controller (550) can includerate control related parameters (picture skip, quantizer, lambda valueof rate-distortion optimization techniques, . . . ), picture size, groupof pictures (GOP) layout, maximum motion vector allowed reference area,and so forth. The controller (550) can be configured to have othersuitable functions that pertain to the video encoder (503) optimized fora certain system design.

In some embodiments, the video encoder (503) is configured to operate ina coding loop. As an oversimplified description, in an example, thecoding loop can include a source coder (530) (e.g., responsible forcreating symbols, such as a symbol stream, based on an input picture tobe coded, and a reference picture(s)), and a (local) decoder (533)embedded in the video encoder (503). The decoder (533) reconstructs thesymbols to create the sample data in a similar manner as a (remote)decoder also would create (as any compression between symbols and codedvideo bitstream is lossless in the video compression technologiesconsidered in the disclosed subject matter). The reconstructed samplestream (sample data) is input to the reference picture memory (534). Asthe decoding of a symbol stream leads to bit-exact results independentof decoder location (local or remote), the content in the referencepicture memory (534) is also bit exact between the local encoder andremote encoder. In other words, the prediction part of an encoder “sees”as reference picture samples exactly the same sample values as a decoderwould “see” when using prediction during decoding. This fundamentalprinciple of reference picture synchronicity (and resulting drift, ifsynchronicity cannot be maintained, for example because of channelerrors) is used in some related arts as well.

The operation of the “local” decoder (533) can be the same as of a“remote” decoder, such as the video decoder (410), which has alreadybeen described in detail above in conjunction with FIG. 4 . Brieflyreferring also to FIG. 4 , however, as symbols are available andencoding/decoding of symbols to a coded video sequence by an entropycoder (545) and the parser (420) can be lossless, the entropy decodingparts of the video decoder (410), including the buffer memory (415) andthe parser (420) may not be fully implemented in the local decoder(533).

An observation that can be made at this point is that any decodertechnology except the parsing/entropy decoding that is present in adecoder also necessarily needs to be present, in substantially identicalfunctional form, in a corresponding encoder. For this reason, thedisclosed subject matter focuses on decoder operation. The descriptionof encoder technologies can be abbreviated as they are the inverse ofthe comprehensively described decoder technologies. Only in certainareas a more detail description is required and provided below.

During operation, in some examples, the source coder (530) may performmotion compensated predictive coding, which codes an input picturepredictively with reference to one or more previously-coded picture fromthe video sequence that were designated as “reference pictures”. In thismanner, the coding engine (532) codes differences between pixel blocksof an input picture and pixel blocks of reference picture(s) that may beselected as prediction reference(s) to the input picture.

The local video decoder (533) may decode coded video data of picturesthat may be designated as reference pictures, based on symbols createdby the source coder (530). Operations of the coding engine (532) mayadvantageously be lossy processes. When the coded video data may bedecoded at a video decoder (not shown in FIG. 5 ), the reconstructedvideo sequence typically may be a replica of the source video sequencewith some errors. The local video decoder (533) replicates decodingprocesses that may be performed by the video decoder on referencepictures and may cause reconstructed reference pictures to be stored inthe reference picture cache (534). In this manner, the video encoder(503) may store copies of reconstructed reference pictures locally thathave common content as the reconstructed reference pictures that will beobtained by a far-end video decoder (absent transmission errors).

The predictor (535) may perform prediction searches for the codingengine (532). That is, for a new picture to be coded, the predictor(535) may search the reference picture memory (534) for sample data (ascandidate reference pixel blocks) or certain metadata such as referencepicture motion vectors, block shapes, and so on, that may serve as anappropriate prediction reference for the new pictures. The predictor(535) may operate on a sample block-by-pixel block basis to findappropriate prediction references. In some cases, as determined bysearch results obtained by the predictor (535), an input picture mayhave prediction references drawn from multiple reference pictures storedin the reference picture memory (534).

The controller (550) may manage coding operations of the source coder(530), including, for example, setting of parameters and subgroupparameters used for encoding the video data.

Output of all aforementioned functional units may be subjected toentropy coding in the entropy coder (545). The entropy coder (545)translates the symbols as generated by the various functional units intoa coded video sequence, by lossless compressing the symbols according totechnologies such as Huffman coding, variable length coding, arithmeticcoding, and so forth.

The transmitter (540) may buffer the coded video sequence(s) as createdby the entropy coder (545) to prepare for transmission via acommunication channel (560), which may be a hardware/software link to astorage device which would store the encoded video data. The transmitter(540) may merge coded video data from the video coder (503) with otherdata to be transmitted, for example, coded audio data and/or ancillarydata streams (sources not shown).

The controller (550) may manage operation of the video encoder (503).During coding, the controller (550) may assign to each coded picture acertain coded picture type, which may affect the coding techniques thatmay be applied to the respective picture. For example, pictures oftenmay be assigned as one of the following picture types:

An Intra Picture (I picture) may be one that may be coded and decodedwithout using any other picture in the sequence as a source ofprediction. Some video codecs allow for different types of intrapictures, including, for example Independent Decoder Refresh (“IDR”)Pictures. A person skilled in the art is aware of those variants of Ipictures and their respective applications and features.

A predictive picture (P picture) may be one that may be coded anddecoded using intra prediction or inter prediction using at most onemotion vector and reference index to predict the sample values of eachblock.

A bi-directionally predictive picture (B Picture) may be one that may becoded and decoded using intra prediction or inter prediction using atmost two motion vectors and reference indices to predict the samplevalues of each block. Similarly, multiple-predictive pictures can usemore than two reference pictures and associated metadata for thereconstruction of a single block.

Source pictures commonly may be subdivided spatially into a plurality ofsample blocks (for example, blocks of 4×4, 8×8, 4×8, or 16×16 sampleseach) and coded on a block-by-block basis. Blocks may be codedpredictively with reference to other (already coded) blocks asdetermined by the coding assignment applied to the blocks' respectivepictures. For example, blocks of I pictures may be codednon-predictively or they may be coded predictively with reference toalready coded blocks of the same picture (spatial prediction or intraprediction). Pixel blocks of P pictures may be coded predictively, viaspatial prediction or via temporal prediction with reference to onepreviously coded reference picture. Blocks of B pictures may be codedpredictively, via spatial prediction or via temporal prediction withreference to one or two previously coded reference pictures.

The video encoder (503) may perform coding operations according to apredetermined video coding technology or standard, such as ITU-T Rec.H.265. In its operation, the video encoder (503) may perform variouscompression operations, including predictive coding operations thatexploit temporal and spatial redundancies in the input video sequence.The coded video data, therefore, may conform to a syntax specified bythe video coding technology or standard being used.

In an embodiment, the transmitter (540) may transmit additional datawith the encoded video. The source coder (530) may include such data aspart of the coded video sequence. Additional data may comprisetemporal/spatial/SNR enhancement layers, other forms of redundant datasuch as redundant pictures and slices, SEI messages, VUI parameter setfragments, and so on.

A video may be captured as a plurality of source pictures (videopictures) in a temporal sequence. Intra-picture prediction (oftenabbreviated to intra prediction) makes use of spatial correlation in agiven picture, and inter-picture prediction makes uses of the (temporalor other) correlation between the pictures. In an example, a specificpicture under encoding/decoding, which is referred to as a currentpicture, is partitioned into blocks. When a block in the current pictureis similar to a reference block in a previously coded and still bufferedreference picture in the video, the block in the current picture can becoded by a vector that is referred to as a motion vector. The motionvector points to the reference block in the reference picture, and canhave a third dimension identifying the reference picture, in casemultiple reference pictures are in use.

In some embodiments, a bi-prediction technique can be used in theinter-picture prediction. According to the bi-prediction technique, tworeference pictures, such as a first reference picture and a secondreference picture that are both prior in decoding order to the currentpicture in the video (but may be in the past and future, respectively,in display order) are used. A block in the current picture can be codedby a first motion vector that points to a first reference block in thefirst reference picture, and a second motion vector that points to asecond reference block in the second reference picture. The block can bepredicted by a combination of the first reference block and the secondreference block.

Further, a merge mode technique can be used in the inter-pictureprediction to improve coding efficiency.

According to some embodiments of the disclosure, predictions, such asinter-picture predictions and intra-picture predictions are performed inthe unit of blocks. For example, according to the HEVC standard, apicture in a sequence of video pictures is partitioned into coding treeunits (CTU) for compression, the CTUs in a picture have the same size,such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. In general, a CTUincludes three coding tree blocks (CTBs), which are one luma CTB and twochroma CTBs. Each CTU can be recursively quad-tree split into one ormultiple coding units (CUs). For example, a CTU of 64×64 pixels can besplit into one CU of 64×64 pixels, or 4 CUs of 32×32 pixels, or 16 CUsof 16×16 pixels. In an example, each CU is analyzed to determine aprediction type for the CU, such as an inter prediction type or an intraprediction type. The CU is split into one or more prediction units (PUs)depending on the temporal and/or spatial predictability. Generally, eachPU includes a luma prediction block (PB), and two chroma PBs. In anembodiment, a prediction operation in coding (encoding/decoding) isperformed in the unit of a prediction block. Using a luma predictionblock as an example of a prediction block, the prediction block includesa matrix of values (e.g., luma values) for pixels, such as 8×8 pixels,16×16 pixels, 8×16 pixels, 16×8 pixels, and the like.

FIG. 6 shows a diagram of a video encoder (603) according to anotherembodiment of the disclosure. The video encoder (603) is configured toreceive a processing block (e.g., a prediction block) of sample valueswithin a current video picture in a sequence of video pictures, andencode the processing block into a coded picture that is part of a codedvideo sequence. In an example, the video encoder (603) is used in theplace of the video encoder (303) in the FIG. 3 example.

In an HEVC example, the video encoder (603) receives a matrix of samplevalues for a processing block, such as a prediction block of 8×8samples, and the like. The video encoder (603) determines whether theprocessing block is best coded using intra mode, inter mode, orbi-prediction mode using, for example, rate-distortion optimization.When the processing block is to be coded in intra mode, the videoencoder (603) may use an intra prediction technique to encode theprocessing block into the coded picture; and when the processing blockis to be coded in inter mode or bi-prediction mode, the video encoder(603) may use an inter prediction or bi-prediction technique,respectively, to encode the processing block into the coded picture. Incertain video coding technologies, merge mode can be an inter pictureprediction submode where the motion vector is derived from one or moremotion vector predictors without the benefit of a coded motion vectorcomponent outside the predictors. In certain other video codingtechnologies, a motion vector component applicable to the subject blockmay be present. In an example, the video encoder (603) includes othercomponents, such as a mode decision module (not shown) to determine themode of the processing blocks.

In the FIG. 6 example, the video encoder (603) includes the interencoder (630), an intra encoder (622), a residue calculator (623), aswitch (626), a residue encoder (624), a general controller (621), andan entropy encoder (625) coupled together as shown in FIG. 6 .

The inter encoder (630) is configured to receive the samples of thecurrent block (e.g., a processing block), compare the block to one ormore reference blocks in reference pictures (e.g., blocks in previouspictures and later pictures), generate inter prediction information(e.g., description of redundant information according to inter encodingtechnique, motion vectors, merge mode information), and calculate interprediction results (e.g., predicted block) based on the inter predictioninformation using any suitable technique. In some examples, thereference pictures are decoded reference pictures that are decoded basedon the encoded video information.

The intra encoder (622) is configured to receive the samples of thecurrent block (e.g., a processing block), in some cases compare theblock to blocks already coded in the same picture, generate quantizedcoefficients after transform, and in some cases also intra predictioninformation (e.g., an intra prediction direction information accordingto one or more intra encoding techniques). In an example, the intraencoder (622) also calculates intra prediction results (e.g., predictedblock) based on the intra prediction information and reference blocks inthe same picture.

The general controller (621) is configured to determine general controldata and control other components of the video encoder (603) based onthe general control data. In an example, the general controller (621)determines the mode of the block, and provides a control signal to theswitch (626) based on the mode. For example, when the mode is the intramode, the general controller (621) controls the switch (626) to selectthe intra mode result for use by the residue calculator (623), andcontrols the entropy encoder (625) to select the intra predictioninformation and include the intra prediction information in thebitstream; and when the mode is the inter mode, the general controller(621) controls the switch (626) to select the inter prediction resultfor use by the residue calculator (623), and controls the entropyencoder (625) to select the inter prediction information and include theinter prediction information in the bitstream.

The residue calculator (623) is configured to calculate a difference(residue data) between the received block and prediction resultsselected from the intra encoder (622) or the inter encoder (630). Theresidue encoder (624) is configured to operate based on the residue datato encode the residue data to generate the transform coefficients. In anexample, the residue encoder (624) is configured to convert the residuedata from a spatial domain to a frequency domain, and generate thetransform coefficients. The transform coefficients are then subject toquantization processing to obtain quantized transform coefficients. Invarious embodiments, the video encoder (603) also includes a residuedecoder (628). The residue decoder (628) is configured to performinverse-transform, and generate the decoded residue data. The decodedresidue data can be suitably used by the intra encoder (622) and theinter encoder (630). For example, the inter encoder (630) can generatedecoded blocks based on the decoded residue data and inter predictioninformation, and the intra encoder (622) can generate decoded blocksbased on the decoded residue data and the intra prediction information.The decoded blocks are suitably processed to generate decoded picturesand the decoded pictures can be buffered in a memory circuit (not shown)and used as reference pictures in some examples.

The entropy encoder (625) is configured to format the bitstream toinclude the encoded block. The entropy encoder (625) is configured toinclude various information according to a suitable standard such asHEVC. In an example, the entropy encoder (625) is configured to includethe general control data, the selected prediction information (e.g.,intra prediction information or inter prediction information), theresidue information, and other suitable information in the bitstream.Note that, according to the disclosed subject matter, when coding ablock in the merge submode of either inter mode or bi-prediction mode,there is no residue information.

FIG. 7 shows a diagram of a video decoder (710) according to anotherembodiment of the disclosure. The video decoder (710) is configured toreceive coded pictures that are part of a coded video sequence, anddecode the coded pictures to generate reconstructed pictures. In anexample, the video decoder (710) is used in the place of the videodecoder (310) in the FIG. 3 example.

In the FIG. 7 example, the video decoder (710) includes an entropydecoder (771), an inter decoder (780), a residue decoder (773), areconstruction module (774), and an intra decoder (772) coupled togetheras shown in FIG. 7 .

The entropy decoder (771) can be configured to reconstruct, from thecoded picture, certain symbols that represent the syntax elements ofwhich the coded picture is made up. Such symbols can include, forexample, the mode in which a block is coded (such as, for example, intramode, inter mode, bi-predicted mode, the latter two in merge submode oranother submode), prediction information (such as, for example, intraprediction information or inter prediction information) that canidentify certain sample or metadata that is used for prediction by theintra decoder (772) or the inter decoder (780), respectively, residualinformation in the form of, for example, quantized transformcoefficients, and the like. In an example, when the prediction mode isinter or bi-predicted mode, the inter prediction information is providedto the inter decoder (780); and when the prediction type is the intraprediction type, the intra prediction information is provided to theintra decoder (772). The residual information can be subject to inversequantization and is provided to the residue decoder (773).

The inter decoder (780) is configured to receive the inter predictioninformation, and generate inter prediction results based on the interprediction information.

The intra decoder (772) is configured to receive the intra predictioninformation, and generate prediction results based on the intraprediction information.

The residue decoder (773) is configured to perform inverse quantizationto extract de-quantized transform coefficients, and process thede-quantized transform coefficients to convert the residual from thefrequency domain to the spatial domain. The residue decoder (773) mayalso require certain control information (to include the QuantizerParameter (QP)), and that information may be provided by the entropydecoder (771) (data path not depicted as this may be low volume controlinformation only).

The reconstruction module (774) is configured to combine, in the spatialdomain, the residual as output by the residue decoder (773) and theprediction results (as output by the inter or intra prediction modulesas the case may be) to form a reconstructed block, that may be part ofthe reconstructed picture, which in turn may be part of thereconstructed video. It is noted that other suitable operations, such asa deblocking operation and the like, can be performed to improve thevisual quality.

It is noted that the video encoders (303), (503), and (603), and thevideo decoders (310), (410), and (710) can be implemented using anysuitable technique. In an embodiment, the video encoders (303), (503),and (603), and the video decoders (310), (410), and (710) can beimplemented using one or more integrated circuits. In anotherembodiment, the video encoders (303), (503), and (603), and the videodecoders (310), (410), and (710) can be implemented using one or moreprocessors that execute software instructions.

II. Deblocking Filter In HEVC

According to aspects of the disclosure, video coding technologies caninclude filtering operations that are performed on reconstructed samplesso that artifacts resulting from lossy compression, such as byquantization, can be reduced. A deblocking filter process is used in onesuch filtering operation, in which a block boundary between two adjacentblocks can be filtered so that a smoother transition of sample valuesfrom one block to the other block can be achieved.

In some related examples (e.g., HEVC), the deblocking filter process canbe applied to samples adjacent to the block boundary. The deblockingfilter process can be performed for each CU in the same order as thedecoding process. For example, the deblocking filter process can beperformed by horizontal filtering for vertical boundaries for an entirepicture first, followed by vertical filtering for horizontal boundariesfor the entire picture. Filtering can be applied to 8×8 block boundarieswhich are determined to be filtered, both for luma and chromacomponents. 4×4 block boundaries are not processed in order to reducethe complexity.

A boundary strength (BS) can be used to indicate a degree or strength ofthe deblocking filter process. In an embodiment, a value of 2 for BSindicates strong filtering, 1 indicates weak filtering, and 0 indicatesno deblocking filtering.

FIG. 8 shows a flowchart of a process (800) for determining a BS valueaccording to an embodiment of the disclosure. It is noted that the orderof the steps in FIG. 8 can be reordered or one or more steps omitted orreplaced in other embodiments.

In FIG. 8 , P and Q are two adjacent blocks with a boundary therebetween. In a vertical boundary case, P can represent a block located tothe left of the boundary and Q can represent a block located to theright of the boundary. In a horizontal boundary case, P can represent ablock located above the boundary and Q can represent a block locatedbelow the boundary.

In FIG. 8 , a BS value can be determined based on a prediction mode(e.g., intra coding mode), a non-zero transform coefficient (orexistence of non-zero transform coefficients), a reference picture, anumber of motion vectors, and/or a motion vector difference.

At step (S810), the process (800) determines whether P or Q is coded inan intra prediction mode. When at least one of P and Q is determined tobe coded in the intra prediction mode, the process (800) determines afirst value (e.g., 2) for the BS. Otherwise, the process (800) proceedsto step (S820).

At step (S820), the process (800) determines whether P or Q has anon-zero transform coefficient. When at least one of P and Q isdetermined to have a non-zero transform coefficient, the process (800)determines a second value (e.g., 1) for the BS. Otherwise, the process(800) proceeds to step (S830).

At step (S830), the process (800) determines whether P and Q havedifferent reference pictures. When P and Q are determined to havedifferent reference pictures, the process (800) determines a third value(e.g., 1) for the BS. Otherwise, the process (800) proceeds to step(S840).

At step (S840), the process (800) determines whether P and Q havedifferent numbers of motion vectors. When P and Q are determined to havedifferent numbers of motion vectors, the process (800) determines afourth value (e.g., 1) for the BS. Otherwise, the process (800) proceedsto step (S850).

At step (S850), the process (800) determines whether a motion vectordifference between P and Q is above or equal to a threshold T. When themotion vector difference between P and Q is determined to be above orequal to the threshold T, the process (800) determines a fifth value(e.g., 1) for the BS. Otherwise, the process (800) determines a sixthvalue (e.g., 0) for the BS. In an embodiment, the threshold T is set to1 pixel. In the FIG. 8 example, the MV precision is ¼ pixel, so a valueof the MV difference threshold can be set to 4. In another example, ifthe MV precision is 1/16, the value of the MV difference can be set to16.

It is noted that in the FIG. 8 example, the second through the fifthvalues are set as 1. However, in another example, some or all of thesecond through the fifth values may be set as different values.

In some embodiments, a BS can be calculated on a 4×4 block basis, butthe BS can be re-mapped to an 8×8 grid. For example, a maximum of thetwo values of BS which correspond to 8 pixels consisting of a line inthe 4×4 grid is selected as the BS for the boundaries in the 8×8 grid.

III. Deblocking Filter In VVC

In some related examples such as VVC Test model 5 (VTM5), the deblockingfilter process can be based on those used in HEVC and include somemodifications. For example, the filter strength of the deblocking filtercan be dependent on an averaged luma level of reconstructed samples, adeblocking t_(C) table can be extended, stronger deblocking filters canbe used for luma and chroma components, a luma deblocking filter can beapplied on a 4×4 sample grid, and a chroma deblocking filter can beapplied on an 8×8 sample grid.

In some related examples such as HEVC, the filter strength of thedeblocking filter can be controlled by the variables β and t_(C) whichare derived from an averaged quantization parameters qP_(L). In somerelated examples such as VTM5, the deblocking filter can control thefilter strength by adding an offset to the average quantizationparameter qP_(L) according to the luma level of the reconstructedsamples. The reconstructed luma level LL can be derived as,

LL=((p _(0,0) +p _(0,3) +q _(0,0) +q _(0,3))>>2)/(1<<bitDepth)  (Eq. 1)

where the sample values p_(i,k) and q_(i,k) with i=0 . . . 3 and k=0 and3 are derived as shown in FIG. 9 .

The variable qPL can be derived as,

qPL=((Qp _(Q) +Qp _(P)+1)>>1)+qpOffset  (Eq. 2)

where Qp_(Q) and Qp_(P) denote the quantization parameters of the codingunits containing the sample q_(0,0) and p_(0,0), respectively. Theoffset qpOffset is dependent on a transfer function and thereconstructed luma level LL. The mapping function of qpOffset and theluma level can be signaled in the sequence parameter set (SPS) andderived according to transfer characteristics of contents since thetransfer function can vary among video formats.

In some related examples such as VTM5, maximum QP can be extended to be63. In order to reflect the corresponding change to the deblocking tablewhich derive values of deblocking parameters based on the block QP, thet_(C) table can accommodate the extension of the QP range as t_(C)=[0,0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1,1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 8, 9, 10, 11, 13,14, 16, 18, 20, 22, 25, 28, 31, 35, 39, 44, 50, 56, 63, 70, 79, 88, 99].

In some related examples, a stronger deblocking filter (e.g., bilinearfilter) can be used when samples at either one side of a boundary belongto a large block. The large block can be defined as when a width of theblock is larger than or equal to 32 for a vertical edge, and when aheight of the block is larger than or equal to 32 for a horizontal edge.Block boundary samples p_(i) for i=0 to Sp−1 and q_(i) for j=0 to Sq−1are then replaced by linear interpolation as follows:

p _(i)′=(f _(i)*Middle_(s,t)+(64−f _(i))*P _(s)+32)>>6), clipped to p_(i)±tcPD_(i)  (Eq. 3)

q ₁′=(g _(j)*Middle_(s,t)+(64−g _(j))*Q _(s)+32)>>6), clipped to q_(j)±tcPD_(j)  (Eq. 4)

where parameters tcPD_(i) and tcPD_(j) are position dependent clippingparameters and g_(j), f_(i), Middle_(s,t), P_(s), and Q_(s) are given inthe Table 1.

TABLE 1 Sp, Sq f_(i) = 59 − i * 9, can also be described as f ={59,50,41,32,23,14,5} 7, 7 g_(j) = 59 − j * 9, can also be described asg = {59,50,41,32,23,14,5} (p side: Middle_(7,7) = (2 * (p_(o) + q_(o)) +p₁ + q₁ + p₂ + q₂ + p₃ + 7, q₃ + p₄ + q₄ + p₅ + q₅ + p₆ + q₆ + 8) >> 4 qside: P₇ = (p₆ + p₇ + 1) >> 1, Q₇ = (q₆ + q₇ + 1) >> 1 7) 7, 3 f_(i) =59 − i * 9, can also be described as f = {59,50,41,32,23,14,5} (p side:g_(j) = 53 − j * 21, can also be described as g = {53,32,11} 7 q side:Middle_(7,3) = (2 * (p_(o) + q_(o)) + q₀ + 2 * (q₁ + q₂) + p₁ + 3) q₁ +p₂ + p₃ + p₄ + p₅ + p₆ + 8) >> 4 P₇ = (p₆ + p₇ + 1) >> 1, Q₃ = (q₂ +q₃ + 1) >> 1 3, 7 g_(j) = 59 − j * 9, can also be described as g ={59,50,41,32,23,14,5} (p side: f_(i) = 53 − i * 21, can also bedescribed as f = {53,32,11} 3 Middle_(3,7) = (2 * (q_(o) + p₀) + p₀ +2 * (p₁ + p₂) + q₁ + q side: p₁ + q₂ + q₃ + q₄ + q₅ + q₆ + 8) >> 4 7) Q₇= (q₆ + q₇ + 1) >> 1, P₃ = (p₂ + p₃ + 1) >> 1 7, 5 g_(j) = 58 − j * 13,can also be described as g = {58,45,32,19,6} (p side: f_(i) = 59 − i *9, can also be described as f = {59,50,41,32,23,14,5} 7 Middle7,5 = (2 *(p_(o) + q₀ + p₁ + q₁) + q₂ + p₂ + q₃ + q side: p₃ + q₄ + p₄ + q₅ + p₅ +8) >> 4 5) Q₅ = (q₄ + q₅ + 1) >> 1, P₇ = (p₆ + p₇ + 1) >> 1 5, 7 g_(j) =59 − j * 9, can also be described as g = {59,50,41,32,23,14,5} (p side:f_(i) = 58 − i * 13, can also be described as f = {58,45,32,19,6} 5Middle5,7 = (2 * (q₀ + p₀ + p₁ + q₁) + q₂ + p₂ + q side: q₃ + p₃ + q₄ +p₄ + q₅ + p₅ + 8) >> 4 7) Q₇ = (q₆ + q₇ + 1) >> 1, P₅ = (p₄ + p₅ + 1) >>1 5, 5 g_(j) = 58 − j * 13, can also be described as g = {58,45,32,19,6}(p side: f_(i) = 58 − i * 13, can also be described as f ={58,45,32,19,6} 5 Middle5,5 = (2 * (q₀ + p₀ + p₁ + q₁ + q₂ + p₂) + qside: q₃ + p₃ + q₄ + p₄ + 8) >> 4 5) Q₅ = (q₄ + q₅ + 1) >> 1, P₅ = (p₄ +p₅ +1) >> 1 5, 3 g_(j) = 53 − j * 21, can also be described as g ={53,32,11} (p side: f_(i) = 58 − i * 13, can also be described as f ={58,45,32,19,6} 5 Middle5,3 = (q₀ + p₀ + p₁ + q₁ + q₂ + p₂ + q₃ + p₃ +4) >> 3 q side: Q₃ = (q₂ + q₃ + 1) >> 1, P₅ = (p₄ + p₅ + 1) >> 1 3) 3, 5g_(j) = 58 − j * 13, can also be described as g = {58,45,32,19,6} (pside: f_(i) = 53 − i * 21, can also be described as f = {53,32,11} 3Middle3,5 = (q₀ + p₀ + p₁ + q₁ + q₂ + p₂ + q₃ + p₃ + 4) >> 3 q side: Q₅= (q₄ + q₅ + 1) >> 1, P₃= (p₂ + p₃ + 1) >> 1 5)

In some embodiments, the stronger luma filters can be used only if allof condition1, condition2, and condition 3 are TRUE. The condition 1 isreferred to as a large block condition. This condition detects whetherthe samples at P-side and Q-side belong to large blocks. The condition 2and condition 3 are determined as follows:

Condition2=(d<β)?TRUE:FALSE  (Eq. 5)

Condition3=StrongFilterCondition=(dpq is less than (β>>2), sp ₃ +sq ₃ isless than (3*β>>5), and Abs(p ₀ −q ₀) is less than (5*t_(C)+1)>>1)?TRUE:FALSE  (Eq. 6)

where d, dpq, sp and sq are magnitudes of gradient calculations todetermine amounts of detail in comparison to a threshold based on β,which is a QP dependent coding noise threshold, to avoid removingdetails by the filtering. Similarly, it is also checked that themagnitude of the gradient across the boundary is less than a thresholdbased on t_(C), which is a QP dependent deblocking strength threshold.

In some embodiments, a strong deblocking filter for chroma can bedefined as follows:

p2′=(3*p3+2*p2+p1+p0+q0+4)>>3  (Eq. 7)

p1′=(2*p3+p2+2*p1+p0+q0+q1+4)>>3  (Eq. 8)

p0′=(p3+p2+p1+2*p0+q0+q1+q2+4)>>3  (Eq. 9)

In an embodiment, the strong deblocking filter for chroma can performdeblocking on an 8×8 chroma sample grid. The chroma strong filter can beused on samples at both sides of the block boundary. For example, thechroma strong filter can be selected when both sides of the blockboundary are greater than or equal to 8 (in units of chroma sample) andthe following three decisions are satisfied. The first decision is todetermine either one of two blocks separated by the block boundary is alarge block. The second and third decisions are a deblocking filteron/off decision and a strong filter decision, respectively, which can bethe same as those in some related examples such as HEVC. In the firstdecision, the BS can be modified for chroma filtering as shown in theTable 2. The conditions in the Table 2 are checked sequentially. If acondition is satisfied, then the remaining conditions with lowerpriorities are skipped.

TABLE 2 Priority Conditions Y U V 5 At least one of the adjacent blocksis intra 2 2 2 4 At least one of the adjacent blocks has non-zerotransform 1 1 1 coefficients 3 Absolute difference between the motionvectors that belong to 1 N/A N/A the adjacent blocks is greater than orequal to one integer luma sample 2 Motion prediction in the adjacentblocks refers to vectors is 1 N/A N/A different 1 Otherwise 0 0 0

In an embodiment, the chroma deblocking can be performing when BS isequal to 2, or BS is equal to 1 with a large block boundary beingdetected. In such a case, the second and third decisions are basicallythe same as HEVC luma strong filter decision.

In some related examples such as VVC, the deblocking filter can beenabled on a 4×4 grid for luma and an 8×8 grid for chroma. Thedeblocking filter process can be applied to the CU boundaries andsub-block boundaries. The sub-block boundaries can include theprediction unit boundaries introduced by sub-block-based temporal motionvector prediction (SbTMVP) and affine modes, and the transform unitboundaries introduced by sub-block transform (SBT) and intrasub-partition (ISP) modes.

For SBT and ISP sub-blocks, the deblocking filter used for TU in HEVCcan be applied. For example, the deblocking filter can be applied to aTU boundary when there are non-zero coefficients in either of thesub-blocks separated by the boundary.

For SbTMVP and affine sub-blocks on 4×4 grids, the deblocking filterused for PU in HEVC can be applied. For example, the deblocking filterfor PU boundaries can be applied with the consideration of thedifference between motion vectors and reference pictures of theneighboring sub-blocks.

IV. Deblocking Filter in Audio Video Coding (AVS) Standard

In some related examples such as the third generation AVS standard(AVS3), the deblocking filter operations can be processed at luma 8×8and chroma 8×8 sample boundaries, including a vertical boundary and ahorizontal boundary for each considered sample block. First, whether ornot a boundary needs to be filtered can be examined. Cases such as apicture boundary, a segmentation boundary (e.g., slice/tile boundary), aboundary inside a coding block, or a transform block boundary, cannotneed to be filtered. If a boundary needs to be filtered, BS can becalculated. For example, the BS can be set to 0 (no filter), 1 (weakfilter), or 2 (strong filter), depending on how much alteration can beachieved in terms of sample value changes after the filtering. Forexample, a strong filter can change sample values near the boundary in amore dramatic way.

In some embodiments, only when the two regions separated by a boundary,such as a left region and a right region separated by the verticalboundary, are considered as flat or smooth regions without high samplevalue fluctuation, the strong filter can be applied to the boundary.Otherwise, weak or no filter can be applied.

In some related examples such as AVS3, a smooth region near a boundarycan be evaluated using a sample difference between a plurality ofsamples, such as two neighboring samples, with one of the plurality ofsamples neighboring to the boundary. A first sample is right at theboundary and a second sample is an immediate neighbor of the firstsample. Both the first sample and second sample are in the same regionat one side of the boundary. For example, in FIG. 10 , the locations ofsamples near the vertical boundary are shown, in which L0 and L1 are thetwo samples that can be used for evaluating the smoothness of the leftregion.

In some embodiments, some modifications for determining the BS can beincluded in AVS3. For example, in a first modification which can bereferred to as an item #1 modification, when sample values of twosamples separated by a boundary (e.g., L0 and R0 in FIG. 10 ) differ bymore than a threshold, no deblocking filter (e.g., no deblocking filterprocess or BS=0) is performed to the boundary. In this case, performingdeblocking can blur the boundary. In a second modification which can bereferred to as an item #2 modification, four samples instead of two atone region along the boundary can be used in the calculation of theregion smoothness for determining the BS value.

V. High Level Control For Deblocking Filter Operations

Embodiments of this disclosure present methods of high level control fordeblocking filter operations.

According to aspects of the disclosure, multiple deblocking filteroperations can be available and allowed for a current block. Forexample, all of the deblocking filter operations in HEVC/VVC/AVS can beavailable and allowed for the current block. The availability of themultiple deblocking filter operations can be indicated by a firstsignaled syntax element, such as an SPS flag. When the SPS flag is TRUE,the multiple deblocking filter operations are available and allowed forthe current block. Otherwise, when the SPS flag is FALSE, only a defaultdeblocking filter operation can be available and allowed for the currentblock.

According to aspects of the disclosure, when the multiple deblockingfilter operations are available and allowed for the current block, asubset of the multiple deblocking filter operations can be enabled forthe current block. The subset of the multiple deblocking filteroperations can be one or more deblocking filter operations inHEVC/VVC/AVS. The subset of the multiple deblocking filter operationscan be indicated by a second signaled syntax element, such as a picturelevel flag. When the picture level flag is TRUE, one of the multipledeblocking filter operations corresponding to the picture level flag isenabled for the current block. In another example, the picture levelflag can indicate a set of deblocking filter operations, so that the setof deblocking filter operations can be enabled for the current blockwhen the picture level flag is true. In some embodiments, the secondsignaled syntax element can be a number value. Accordingly, when thesecond signaled syntax element equals to 1, a first deblocking filteroperation such as one in HEVC is enabled for the current block. When thesecond signaled syntax element equals to 2, a second deblocking filteroperation such as one in VVC is enabled for the current block. When thesecond signaled syntax element equals to 3, a third deblocking filteroperation such as one in AVS is enabled for the current block.

The high level control for deblocking filter operations presented inthis disclosure can be applicable to various video standards and videocodecs. For simplicity, the deblocking filter operations in AVS3 can beused as examples for illustration of high level control for deblockingfilter operations. For example, the modified deblocking filteroperations for AVS3 such as the item #1 and item #2 modifications can beconditionally switched on. If both the item #1 and item #2 modificationsare switched off, the original/default method can still be used.

According to aspects of the disclosure, an SPS flag can be used toindicate whether the modified deblocking filter operation for AVS3 suchas item #1 and item #2 modifications are available or allowed for acurrent block.

In an embodiment, two control flags such as a first control flag and asecond control flag are used for the item #1 and item #2 modifications,respectively. The first control flag can be used to indicate whether theitem #1 modification is enabled for the current block and the secondcontrol flag can be used to indicate whether the item #2 modification isenabled for the current block. The first and second control flags can beincluded in a picture header, a slice header, or in a header where adeblocking filter on/off control flag is presented. Accordingly, thefirst flag is used to control whether a cross-boundary sample differenceneeds to be considered in the decision of applying deblocking to aboundary. The second flag is separately used to control whether foursamples instead of two in the same region adjacent to the boundary canbe used in the calculation of the BS.

In an example, the first and second control flags can be conditionallysignaled by the presence of the SPS flag. Only when the SPS flag is on(enabled), at a lower level such as a picture or a slice header, or aheader where the deblocking filter on/off control flag is presented,these two flags can be signaled. Otherwise, these two flags are inferredto be false (not enabled).

In another example, in addition to the SPS flag being on, the first andsecond control flags are also conditionally signaled by the presence ofthe deblocking filter on/off control flag. Only when the deblockingfilter on/off control flag is turned on at some level such as a picturelevel or a slice level, these two flags can be signaled. Otherwise, whenthe SPS flag is off and/or the deblocking filter on/off control flag isoff, these two flags are inferred to be false (not enabled).

In an embodiment, one control flag is used to enable both item #1 anditem #2 modifications in AVS3. The control flag can be added in thepicture header or slice header, or the header where the deblockingfilter on/off control flag is presented. Accordingly, one flag is usedto control whether the cross-boundary sample difference needs to beconsidered in the decision of applying deblocking to the boundary. Thesame flag is used to control whether four samples instead of two in thesame region adjacent to the boundary can be used in the calculation ofthe BS.

In an example, the control flag can be conditionally signaled by thepresence of the SPS flag. Only when the SPS flag is on (enabled), at alower level such as a picture or a slice header, or a header wheredeblocking filter on/off control flag is presented, the control flag canbe signaled. Otherwise, the control flag is inferred to be false (notenabled).

In another example, in addition to the SPS flag being on, the controlflag is also conditionally signaled by the presence of the deblockingfilter on/off control flag. Only when deblocking filter on/off controlflag is turned on at some level such as a picture level or a slicelevel, the control flag can be signaled. Otherwise, when the SPS flag isoff and/or the deblocking filter on/off control flag is off, the controlflag is inferred to be false (not enabled).

Tables 3 and 4 present SPS level and picture level syntax elementsaccording to an embodiment of the disclosure, respectively.

TABLE 3   if (profile_id == 0x32) {    udip_enable_flag u(1)   ist_enable_flag u(1)    srcc_enable_flag u(1)    ibc_enable_flag u(1)   eipm_enable_flag u(1)    sbt_enable_flag u(1)    bio_enable_flag u(1)   mvap_enable_flag u(1)    if (tscpm_enable_flag == ‘1’) {    enhance_tscpm_flag u(1)    }    sps_dbk_modified_flag u(1)   }

TABLE 4   loop_filter_disable_flag u(1)   if (loop_filter_disable_flag== ‘0’) {    loop_filter_parameter_flag u(1)    if(loop_filter_parameter_flag == ‘1’) {     alpha_c_offset se(v)    beta_offset se(v)    }    if(sps_dbk_modified_flag)    ph_dbk_modification_enabled_flag u(1)   }

In Table 3, the syntax element sps_dbk_modified_flag is the SPS flag. Inan embodiment, when sps_dbk_modified_flag equals to 1, the deblockingfilter operation modifications such as item #1 and item #2 modificationscan be used in the current sequence including the current block. Whensps_dbk_modified_flag equals to 0, the deblocking filter operationmodifications cannot be used in the current sequence. When notpresented, the value of sps_dbk_modified_flag is inferred to be 0.

In Table 4, the syntax element ph_dbk_modification_enabled_flag is thepicture level control flag. When ph_dbk_modification_enabled_flag equalsto 1, one or more deblocking filter operation modifications such as item#1 and item #2 modifications are enabled in the current pictureincluding the current block. When ph_dbk_modification_enabled_flagequals to 0, the one or more deblocking filter modifications aredisabled in the current picture. When not presented, the value ofph_dbk_modification_enabled_flag is inferred to be 0.

In one example, ph_dbk_modification_enabled_flag is used for the item #1modification. In another example, ph_dbk_modification_enabled_flag isused for the item #2 modification. In another example,ph_dbk_modification_enabled_flag is used for both item #1 and item #2modifications.

In an embodiment, a syntax element with different values can be signaledfor the usage of deblocking filter operation modifications. For example,the syntax element such as ph_dbk_modified_idc can be signal at thepicture level or slice level. When ph_dbk_modified_idc equals to 0, nomodifications is allowed. When ph_dbk_modified_idc equals to 1, the item#1 modification is used. When ph_dbk_modified_idc equals to 2, the item#2 modification is used. When ph_dbk_modified_idc equals to 3, both item#1 and item #2 modifications are used.

In an embodiment, a syntax element with different values can be signaledfor the usage of a set of deblocking filter operation modifications. Forexample, the syntax element such as ph_dbk_modification_enabled_idc canbe signal at the picture level or slice level. Whenph_dbk_modification_enabled_idc equals to 0, no modifications isallowed. When ph_dbk_modification_enabled_idc equals to 1, a first setof modifications such as the item #1 and item #2 modifications is used.When ph_dbk_modification_enabled_idc equals to 2, a second set ofmodifications is used. The first set of modifications can overlap withthe second set of modifications in an example. In another example, thefirst set of modifications can be different from the second set ofmodifications.

Accordingly, multiple different deblocking filter operations can beallowed and controlled by the high level control syntax elements and/orflags.

VI. Flowchart

FIG. 11 shows a flow chart outlining an exemplary process (1100)according to an embodiment of the disclosure. In various embodiments,the process (1100) is executed by processing circuitry, such as theprocessing circuitry in the terminal devices (210), (220), (230) and(240), the processing circuitry that performs functions of the videoencoder (303), the processing circuitry that performs functions of thevideo decoder (310), the processing circuitry that performs functions ofthe video decoder (410), the processing circuitry that performsfunctions of the intra prediction module (452), the processing circuitrythat performs functions of the video encoder (503), the processingcircuitry that performs functions of the predictor (535), the processingcircuitry that performs functions of the intra encoder (622), theprocessing circuitry that performs functions of the intra decoder (772),and the like. In some embodiments, the process (1100) is implemented insoftware instructions, thus when the processing circuitry executes thesoftware instructions, the processing circuitry performs the process(1100).

The process (1100) may generally start at step (S1110), where theprocess (1100) decodes prediction information for a current block in acurrent picture that is a part of a coded video sequence. The predictioninformation includes a first syntax element and a second syntax element.Then, the process (1100) proceeds to step (S1120).

At step (S1120), the process (1100) determines whether a plurality ofprocesses of determining a BS of a deblocking filter is allowed for thecurrent block based on the first syntax element. The deblocking filteris applied to a boundary of the current block. When the plurality ofprocesses of determining the BS of the deblocking filter is allowed forthe current block, the process (1100) proceeds to step (S1130).Otherwise, the process (1100) proceeds to step (S1150).

At step (S1130), the process (1100) determines a subset of the pluralityof processes of determining the BS of the deblocking filter for thecurrent block based on the second syntax element. Then, the process(1100) proceeds to step (S1140).

At step (S1140), the process (1100) determines the BS of the deblockingfilter for the current block based on the subset of the plurality ofprocesses of determining the BS of the deblocking filter.

At step (S1150), the process (1100) determines the BS of the blockingfilter for the current block based on a default deblocking filterprocess. Then, the process (1100) terminates.

In an embodiment, the BS of the deblocking filter for the current blockis determined based on a plurality of samples located in one of tworegions separated by the boundary of the current block. In an example, anumber of the plurality of samples located in the one of two regionsseparated by the boundary of the current block is one of two and four.

In an embodiment, the process (1100) determines whether a sample valuedifference between two samples separated by the boundary of the currentblock is greater than a threshold. When the sample value differencebetween the two samples separated by the boundary of the current blockis greater than the threshold, the process (1100) determines that nodeblocking filter is applied to the boundary of the current block.

In an embodiment, the first syntax element is at a sequence parameterset level.

In an embodiment, the process (1100) determines the one of the pluralityof processes of determining the BS of the deblocking filter for thecurrent block based on the second syntax element and a deblockingcontrol flag indicating that a filtering operation is enabled for thecurrent block. In an example, the second syntax element is at one of apicture level, a slice level, and a same level as the deblocking controlflag.

VII. Computer System

The techniques described above, can be implemented as computer softwareusing computer-readable instructions and physically stored in one ormore computer-readable media. For example, FIG. 12 shows a computersystem (1200) suitable for implementing certain embodiments of thedisclosed subject matter.

The computer software can be coded using any suitable machine code orcomputer language, that may be subject to assembly, compilation,linking, or like mechanisms to create code comprising instructions thatcan be executed directly, or through interpretation, micro-codeexecution, and the like, by one or more computer central processingunits (CPUs), Graphics Processing Units (GPUs), and the like.

The instructions can be executed on various types of computers orcomponents thereof, including, for example, personal computers, tabletcomputers, servers, smartphones, gaming devices, internet of thingsdevices, and the like.

The components shown in FIG. 12 for computer system (1200) are exemplaryin nature and are not intended to suggest any limitation as to the scopeof use or functionality of the computer software implementingembodiments of the present disclosure. Neither should the configurationof components be interpreted as having any dependency or requirementrelating to any one or combination of components illustrated in theexemplary embodiment of a computer system (1200).

Computer system (1200) may include certain human interface inputdevices. Such a human interface input device may be responsive to inputby one or more human users through, for example, tactile input (such as:keystrokes, swipes, data glove movements), audio input (such as: voice,clapping), visual input (such as: gestures), olfactory input (notdepicted). The human interface devices can also be used to capturecertain media not necessarily directly related to conscious input by ahuman, such as audio (such as: speech, music, ambient sound), images(such as: scanned images, photographic images obtain from a still imagecamera), video (such as two-dimensional video, three-dimensional videoincluding stereoscopic video).

Input human interface devices may include one or more of (only one ofeach depicted): keyboard (1201), mouse (1202), trackpad (1203), touchscreen (1210), data-glove (not shown), joystick (1205), microphone(1206), scanner (1207), camera (1208).

Computer system (1200) may also include certain human interface outputdevices. Such human interface output devices may be stimulating thesenses of one or more human users through, for example, tactile output,sound, light, and smell/taste. Such human interface output devices mayinclude tactile output devices (for example tactile feedback by thetouch-screen (1210), data-glove (not shown), or joystick (1205), butthere can also be tactile feedback devices that do not serve as inputdevices), audio output devices (such as: speakers (1209), headphones(not depicted)), visual output devices (such as screens (1210) toinclude CRT screens, LCD screens, plasma screens, OLED screens, eachwith or without touch-screen input capability, each with or withouttactile feedback capability—some of which may be capable to output twodimensional visual output or more than three dimensional output throughmeans such as stereographic output; virtual-reality glasses (notdepicted), holographic displays and smoke tanks (not depicted)), andprinters (not depicted). These visual output devices (such as screens(1210)) can be connected to a system bus (1248) through a graphicsadapter (1250).

Computer system (1200) can also include human accessible storage devicesand their associated media such as optical media including CD/DVD ROM/RW(1220) with CD/DVD or the like media (1221), thumb-drive (1222),removable hard drive or solid state drive (1223), legacy magnetic mediasuch as tape and floppy disc (not depicted), specialized ROM/ASIC/PLDbased devices such as security dongles (not depicted), and the like.

Those skilled in the art should also understand that term “computerreadable media” as used in connection with the presently disclosedsubject matter does not encompass transmission media, carrier waves, orother transitory signals.

Computer system (1200) can also include a network interface (1254) toone or more communication networks (1255). The one or more communicationnetworks (1255) can for example be wireless, wireline, optical. The oneor more communication networks (1255) can further be local, wide-area,metropolitan, vehicular and industrial, real-time, delay-tolerant, andso on. Examples of the one or more communication networks (1255) includelocal area networks such as Ethernet, wireless LANs, cellular networksto include GSM, 3G, 4G, 5G, LTE and the like, TV wireline or wirelesswide area digital networks to include cable TV, satellite TV, andterrestrial broadcast TV, vehicular and industrial to include CANBus,and so forth. Certain networks commonly require external networkinterface adapters that attached to certain general purpose data portsor peripheral buses (1249) (such as, for example USB ports of thecomputer system (1200)); others are commonly integrated into the core ofthe computer system (1200) by attachment to a system bus as describedbelow (for example Ethernet interface into a PC computer system orcellular network interface into a smartphone computer system). Using anyof these networks, computer system (1200) can communicate with otherentities. Such communication can be uni-directional, receive only (forexample, broadcast TV), uni-directional send-only (for example CANbus tocertain CANbus devices), or bi-directional, for example to othercomputer systems using local or wide area digital networks. Certainprotocols and protocol stacks can be used on each of those networks andnetwork interfaces as described above.

Aforementioned human interface devices, human-accessible storagedevices, and network interfaces can be attached to a core (1240) of thecomputer system (1200).

The core (1240) can include one or more Central Processing Units (CPU)(1241), Graphics Processing Units (GPU) (1242), specialized programmableprocessing units in the form of Field Programmable Gate Areas (FPGA)(1243), hardware accelerators for certain tasks (1244), and so forth.These devices, along with Read-only memory (ROM) (1245), Random-accessmemory (1246), internal mass storage such as internal non-useraccessible hard drives, SSDs, and the like (1247), may be connectedthrough the system bus (1248). In some computer systems, the system bus(1248) can be accessible in the form of one or more physical plugs toenable extensions by additional CPUs, GPU, and the like. The peripheraldevices can be attached either directly to the core's system bus (1248),or through a peripheral bus (1249). Architectures for a peripheral businclude PCI, USB, and the like.

CPUs (1241), GPUs (1242), FPGAs (1243), and accelerators (1244) canexecute certain instructions that, in combination, can make up theaforementioned computer code. That computer code can be stored in ROM(1245) or RAM (1246). Transitional data can be also be stored in RAM(1246), whereas permanent data can be stored for example, in theinternal mass storage (1247). Fast storage and retrieve to any of thememory devices can be enabled through the use of cache memory, that canbe closely associated with one or more CPU (1241), GPU (1242), massstorage (1247), ROM (1245), RAM (1246), and the like.

The computer readable media can have computer code thereon forperforming various computer-implemented operations. The media andcomputer code can be those specially designed and constructed for thepurposes of the present disclosure, or they can be of the kind wellknown and available to those having skill in the computer software arts.

As an example and not by way of limitation, the computer system havingarchitecture (1200), and specifically the core (1240) can providefunctionality as a result of processor(s) (including CPUs, GPUs, FPGA,accelerators, and the like) executing software embodied in one or moretangible, computer-readable media. Such computer-readable media can bemedia associated with user-accessible mass storage as introduced above,as well as certain storage of the core (1240) that are of non-transitorynature, such as core-internal mass storage (1247) or ROM (1245). Thesoftware implementing various embodiments of the present disclosure canbe stored in such devices and executed by core (1240). Acomputer-readable medium can include one or more memory devices orchips, according to particular needs. The software can cause the core(1240) and specifically the processors therein (including CPU, GPU,FPGA, and the like) to execute particular processes or particular partsof particular processes described herein, including defining datastructures stored in RAM (1246) and modifying such data structuresaccording to the processes defined by the software. In addition or as analternative, the computer system can provide functionality as a resultof logic hardwired or otherwise embodied in a circuit (for example:accelerator (1244)), which can operate in place of or together withsoftware to execute particular processes or particular parts ofparticular processes described herein. Reference to software canencompass logic, and vice versa, where appropriate. Reference to acomputer-readable media can encompass a circuit (such as an integratedcircuit (IC)) storing software for execution, a circuit embodying logicfor execution, or both, where appropriate. The present disclosureencompasses any suitable combination of hardware and software.

While this disclosure has described several exemplary embodiments, thereare alterations, permutations, and various substitute equivalents, whichfall within the scope of the disclosure. It will thus be appreciatedthat those skilled in the art will be able to devise numerous systemsand methods which, although not explicitly shown or described herein,embody the principles of the disclosure and are thus within the spiritand scope thereof.

APPENDIX A: ACRONYMS AMVP: Advanced Motion Vector Prediction ASIC:Application-Specific Integrated Circuit ATMVP: Alternative/AdvancedTemporal Motion Vector Prediction BMS: Benchmark Set BV: Block VectorCANBus: Controller Area Network Bus CB: Coding Block CD: Compact DiscCPR: Current Picture Referencing CPUs: Central Processing Units CRT:Cathode Ray Tube CTBs: Coding Tree Blocks CTUs: Coding Tree Units CU:Coding Unit DPB: Decoder Picture Buffer DVD: Digital Video Disc FPGA:Field Programmable Gate Areas GOPs: Groups of Pictures GPUs: GraphicsProcessing Units

GSM: Global System for Mobile communications

HEVC: High Efficiency Video Coding HRD: Hypothetical Reference DecoderIBC: Intra Block Copy IC: Integrated Circuit JEM: Joint ExplorationModel LAN: Local Area Network LCD: Liquid-Crystal Display LTE: Long-TermEvolution MV: Motion Vector OLED: Organic Light-Emitting Diode PBs:Prediction Blocks PCI: Peripheral Component Interconnect PLD:Programmable Logic Device PUs: Prediction Units RAM: Random AccessMemory ROM: Read-Only Memory SCC: Screen Content Coding SEI:Supplementary Enhancement Information SNR: Signal Noise Ratio SSD:Solid-state Drive TUs: Transform Units USB: Universal Serial Bus VUI:Video Usability Information VVC: Versatile Video Coding

What is claimed is:
 1. A method for video decoding in a decoder, themethod comprising: decoding prediction information for a current blockin a current picture that is a part of a coded video sequence, theprediction information including a first syntax element and a secondsyntax element, the first syntax element indicating that a deblockingfilter process is enabled for the current block, the deblocking filterprocess being applied to a boundary of the current block, the secondsyntax element indicating a number of samples to be used for calculatinga boundary strength of the deblocking filter process; determining theboundary strength of the deblocking filter process using the number ofsamples indicated by the second syntax element; and performing thedeblocking filter process for the current block based on the boundarystrength.
 2. The method of claim 1, wherein the determining the boundarystrength of the deblocking filter process comprises: determining theboundary strength of the deblocking filter process for the current blockusing the number of samples indicated by the second syntax element, thenumber of samples being located in one of two regions separated by theboundary of the current block.
 3. The method of claim 2, wherein thesecond syntax element indicates that the number of samples located inthe one of the two regions separated by the boundary of the currentblock is one of two or four.
 4. The method of claim 1, wherein thedetermining the boundary strength of the deblocking filter processcomprises: determining whether a difference of sample values of thesamples is greater than a threshold; and determining that no deblockingfilter process is applied to the boundary of the current block based onthe difference of the sample values of the samples being greater thanthe threshold.
 5. The method of claim 1, wherein the second syntaxelement is at one of a picture level, a slice level, or a same level asthe first syntax element.
 6. The method of claim 1, wherein theprediction information includes a third syntax element indicatingwhether multiple deblocking filter operations are available for thecurrent block.
 7. The method of claim 6, wherein the third syntaxelement is at a sequence parameter set level.
 8. An apparatus,comprising: processing circuitry configured to: decode predictioninformation for a current block in a current picture that is a part of acoded video sequence, the prediction information including a firstsyntax element and a second syntax element, the first syntax elementindicating that a deblocking filter process is enabled for the currentblock, the deblocking filter process being applied to a boundary of thecurrent block, the second syntax element indicating a number of samplesto be used for calculating a boundary strength of the deblocking filterprocess; determine the boundary strength of the deblocking filterprocess using the number of samples indicated by the second syntaxelement; and perform the deblocking filter process for the current blockbased on the boundary strength.
 9. The apparatus of claim 8, wherein theprocessing circuitry is further configured to: determine the boundarystrength of the deblocking filter process for the current block usingthe number of samples indicated by the second syntax element, the numberof samples being located in one of two regions separated by the boundaryof the current block.
 10. The apparatus of claim 9, wherein the secondsyntax element indicates that the number of samples located in the oneof the two regions separated by the boundary of the current block is oneof two or four.
 11. The apparatus of claim 8, wherein the processingcircuitry is further configured to: determine whether a difference ofsample values of the samples is greater than a threshold; and determinethat no deblocking filter process is applied to the boundary of thecurrent block based on the difference of the sample values of thesamples being greater than the threshold.
 12. The apparatus of claim 8,wherein the second syntax element is at one of a picture level, a slicelevel, and a same level as the first syntax element.
 13. The apparatusof claim 8, wherein the prediction information includes a third syntaxelement indicating whether multiple deblocking filter operations areavailable for the current block.
 14. The apparatus of claim 13, whereinthe third syntax element is at a sequence parameter set level.
 15. Anon-transitory computer-readable storage medium storing a programexecutable by at least one computer to perform: decoding predictioninformation for a current block in a current picture that is a part of acoded video sequence, the prediction information including a firstsyntax element and a second syntax element, the first syntax elementindicating that a deblocking filter process is enabled for the currentblock, the deblocking filter process being applied to a boundary of thecurrent block, the second syntax element indicating a number of samplesto be used for calculating a boundary strength of the deblocking filterprocess; determining the boundary strength of the deblocking filterprocess using the number of samples indicated by the second syntaxelement; and performing the deblocking filter process for the currentblock based on the boundary strength.
 16. The non-transitorycomputer-readable storage medium of claim 15, wherein the stored programcauses the at least one computer to perform: determining the boundarystrength of the deblocking filter process for the current block usingthe number of samples indicated by the second syntax element, the numberof samples being located in one of two regions separated by the boundaryof the current block.
 17. The non-transitory computer-readable storagemedium of claim 16, wherein the second syntax element indicates that thenumber of samples located in the one of the two regions separated by theboundary of the current block is one of two or four.
 18. Thenon-transitory computer-readable storage medium of claim 16, wherein thestored program causes the at least one computer to perform: determiningwhether a difference of sample values of the samples is greater than athreshold; and determining that no deblocking filter process is appliedto the boundary of the current block based on the difference of thesample values of the samples being greater than the threshold.
 19. Thenon-transitory computer-readable storage medium of claim 16, wherein thesecond syntax element is at one of a picture level, a slice level, or asame level as the first syntax element.
 20. The non-transitorycomputer-readable storage medium of claim 16, wherein the predictioninformation includes a third syntax element indicating whether multipledeblocking filter operations are available for the current block.